Capturing Motion Verb Generalizations in Synchronous Tree Adjoining Grammars
نویسندگان
چکیده
This paper describes the use of verb class memberships as a means of capturing generalizations about manner-of-motion verbs in Synchronous Tree Adjoining Grammars, STAGs, [20, 21, 22]. This approach allows STAGs, which are essentially transfer-based, to take advantage of the same types of generalizations which are generally thought of as wholly the domain of interlingua systems without giving up any of the lexical specificity unique to transfer-based systems. In this way a machine translation system based on STAGs can respond with seamless flexibility to a wide spectrum of phenomena being presented for translation ranging from idioms and idiosyncratic lexical items to well-behaved verbs that follow lexical rules.
منابع مشابه
Synchronous Grammars as Tree Transducers
Tree transducer formalisms were developed in the formal language theory community as generalizations of finite-state transducers from strings to trees. Independently, synchronous tree-substitution and -adjoining grammars arose in the computational linguistics community as a means to augment strictly syntactic formalisms to provide for parallel semantics. We present the first synthesis of these ...
متن کاملA Tree Transducer Model for Synchronous Tree-Adjoining Grammars
A characterization of the expressive power of synchronous tree-adjoining grammars (STAGs) in terms of tree transducers (or equivalently, synchronous tree substitution grammars) is developed. Essentially, a STAG corresponds to an extended tree transducer that uses explicit substitution in both the input and output. This characterization allows the easy integration of STAG into toolkits for exten...
متن کاملSynchronous Context-Free Tree Grammars
We consider pairs of context-free tree grammars combined through synchronous rewriting. The resulting formalism is at least as powerful as synchronous tree adjoining grammars and linear, nondeleting macro tree transducers, while the parsing complexity remains polynomial. Its power is subsumed by context-free hypergraph grammars. The new formalism has an alternative characterization in terms of ...
متن کاملSynchronous and Multicomponent Tree-Adjoining Grammars: Complexity, Algorithms and Linguistic Applications
This thesis addresses the design of appropriate formalisms and algorithms to be used for natural language processing. This entails a delicate balance between the ability of a formalism to capture the linguistic generalizations required by natural language processing applications and the ability of a natural language processing application based on the formalism to process the formalism efficien...
متن کاملTree parsing for tree-adjoining machine translation
Tree parsing is an important problem in statistical machine translation. In this context, one is given (a) a synchronous grammar that describes the translation from one language into another and (b) a recognizable set of trees; the aim is to construct a finite representation of the set of those derivations that derive elements from the given set, either on the source side (input restriction) or...
متن کامل